Research on Optimization Method and Algorithm Design of Green Simultaneous Pick-up and Delivery Vehicle Scheduling under Uncertain Demand
نویسندگان
چکیده
In order to solve the problem that existing low-carbon vehicle scheduling model ignores economic benefits of enterprises and cannot fully reflect fuzzy needs customers, green simultaneous pick-up delivery is studied here. With goal minimizing total cost composed service cost, fuel consumption carbon emission a multi-objective comprehensive under demand established. consider objective uncertainty customer time, triangular numbers are introduced considered. An improved genetic tabu search algorithm proposed this problem. GA-TS algorithm, penalty factor into fitness function, selection operator combined with elite strategy adopted, mutation proposed. The Taguchi analysis method used obtain reasonable parameter settings algorithm. Finally, case study verify effectiveness hybrid experimental results show can effectively optimize vehicles demand, feasibility verified by comparing different algorithms sizes.
منابع مشابه
Solving Vehicle Routing Problem with Simultaneous Delivery and Pick-up Using Bacterial Foraging Optimization Algorithm
The vehicle routing problem with simultaneous delivery and pick-up (VRPSDP) is a type of the classical vehicle routing problem (VRP) where customers require simultaneous delivery and pick-up service. Deliveries are supplied from a single depot at the beginning of the vehicle’s service, while pick-up loads are taken to the same depot at the end of the service. The objective is to determine the o...
متن کاملA Modified Savings Algorithm Based Approach for Vehicle Routing Problem with Simultaneous Pick-up and Delivery
A key element of many distribution systems is the routing and scheduling of vehicles through a set of nodes requiring service. The Vehicle Routing Problem (VRP) can be defined as a problem of finding the optimal routes of delivery or collection from one or several depots to a number of cities or customers, while satisfying some constraints. In many practical situations, however, the vehicle is ...
متن کاملA tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
The vehicle routing problem with simultaneous pick-up and delivery (VRP_SPD) is a variant of the classical vehicle routing problem (VRP) where clients require simultaneous pick-up and delivery service. Deliveries are supplied from a single depot at the beginning of the vehicle’s service, while pick-up loads are taken to the same depot at the conclusion of the service. One important characterist...
متن کاملAIS-based Algorithm for Solving Vehicle Routing Problem with Simultaneous Pick-up and Delivery (VRP-SPD)
Vehicle Routing Problem with Simultaneous Pick-up and Delivery (VRP-SPD) is regarded as an NP-hard problem, which takes unacceptable time to use traditional algorithms to solve. This article presents an artificial immune systems or AIS-based algorithm to solve the problem and the results shows competitive performance. This algorithm is embedded with a sweep approach to generate random initial p...
متن کاملVehicle Routing Problem with Time Windows and Simultaneous Delivery and Pick-Up Service Based on MCPSO
This paper considers two additional factors of the widely researched vehicle routing problem with time windows VRPTW . The two factors, which are very common characteristics in realworld, are uncertain number of vehicles and simultaneous delivery and pick-up service. Using minimization of the total transport costs as the objective of the extension VRPTW, a mathematic model is constructed. To so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sustainability
سال: 2022
ISSN: ['2071-1050']
DOI: https://doi.org/10.3390/su141912736